Knitting Technique with TP-PT Generations for Petri Net Synthesis

نویسنده

  • Daniel Yuh Chao
چکیده

The behavior of a Petri net (PN) depends not only on the graphical structure, but also on the initial marking of the net. The knitting technique solves the structural problem. It contains some simple yet effective rules which can guide the synthesis of PN with desired properties. The previous knitting technique admits only TT generations among sequential or concurrent processes and PP generations among sequential or exclusive processes. The synthesized nets, however, are restricted because some generations are prohibited. Recently, we have improved the synthesis rules such that the previously forbidden generations are admissible if they are accompanied with additional generations. This paper deals with how to remove the restrictions of TP-path or PT-path generations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Petri Net Synthesis and Synchronization Using Knitting Technique

Petri net (PN) synthesis can avoid the state exploration problem, which is of exponential complexity, by guaranteeing the correctness in the Petri net while incrementally expanding the net. The conventional Petri net synthesis approaches, in general, suffer the drawback of only being able to synthesize a few classes of nets. However, the knitting technique, originally proposed by Chao [1-4], ca...

متن کامل

Petri Nets 2000 Conference

CASCADE is a tool kernel that supports the synthesis of asynchronous controllers. It uses a generalized STG (an interpreted Petri net) as a uni ed design entry and allows the designer to choose between several appropriate design methods. It then transforms the initial speci cation into the design entry required by the chosen style, and interfaces with existing synthesis tools (petrify for SI ci...

متن کامل

A Petri Net Synthesis Method

We motivate and study the synthesis of Petri nets. Petri net synthesis can avoid the state exploration problem by guaranteeing the correctness in the Petri net while incrementally expanding the net. For systems specified in Petri nets, this paper proposes a synthesis method. One major advantage of this synthesis technique is that the resultant ordinary Petri net is guaranteed to be structural l...

متن کامل

Combining Decomposition and Unfolding for STG Synthesis

For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition. The experimental results show significant improvement in terms of runtime compared with other existing methods.

متن کامل

State - based STG implementability properties

State coding connict detection is a fundamental part of synthesis of asynchronous concurrent systems from their speciications as Signal Transition Graphs (STGs), which are a special kind of labelled Petri nets. The paper develops a method for identifying state coding connicts in STGs that is intended to work within a new synthesis framework based on Petri net unfolding. The latter ooers potenti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2006